Octants are Cover Decomposable
نویسندگان
چکیده
We prove that octants are cover-decomposable, i.e., any 12-fold covering of any subset of the space with a finite number of translates of a given octant can be decomposed into two coverings. As a corollary, we obtain that any 12-fold covering of any subset of the plane with a finite number of homothetic copies of a given triangle can be decomposed into two coverings. We also show that any 12-fold covering of the whole plane with open triangles can be decomposed into two coverings. However, we exhibit an indecomposable 3-fold covering.
منابع مشابه
Octants are cover-decomposable into many coverings
We prove that octants are cover-decomposable into multiple coverings, i.e., for any k there is an m(k) such that any m(k)-fold covering of any subset of the space with a nite number of translates of a given octant can be decomposed into k coverings. As a corollary, we obtain that any m(k)-fold covering of any subset of the plane with a nite number of homothetic copies of a given triangle can be...
متن کاملMultiple Coverings with Closed Polygons
A planar set P is said to be cover-decomposable if there is a constant k = k(P ) such that every k-fold covering of the plane with translates of P can be decomposed into two coverings. It is known that open convex polygons are cover-decomposable. Here we show that closed, centrally symmetric convex polygons are also cover-decomposable. We also show that an infinite-fold covering of the plane wi...
متن کاملCover Decomposability of Convex Polygons and Octants
Imagine a universe, which is basically a set of points (that may be infinite), and a collection of sensors. Each sensor has a specified covering region in the universe, i.e, a subset of the universe which it covers (monitors). Moreover, the sensors are powered by battery and they have two alternating modes of action, active and passive. In active mode a sensor covers its region and in passive m...
متن کاملIndecomposable coverings with unit discs
We disprove the 1980 conjecture of János Pach about the cover-decomposability of open convex sets by showing that the unit disc is not cover-decomposable. In fact, our proof easily generalizes to any set with a smooth boundary. We also show that (the suitable variant of) the conjecture holds for unbounded sets. Let C be a collection of sets in R2. We say that C is an m-fold covering if every po...
متن کاملVertex-decomposable Graphs, Codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford Regularity
We call a vertex x of a graph G = (V,E) a codominated vertex if NG[y] ⊆ NG[x] for some vertex y ∈ V \{x}, and a graph G is called codismantlable if either it is an edgeless graph or it contains a codominated vertex x such that G − x is codismantlable. We show that (C4, C5)-free vertex-decomposable graphs are codismantlable, and prove that if G is a (C4, C5, C7)-free well-covered graph, then ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 47 شماره
صفحات -
تاریخ انتشار 2011